Solving Combinatorial Problems with a Constraint Functional Logic Language
نویسندگان
چکیده
This paper describes a proposal to incorporate nite domain constraints in a functional logic system. The proposal integrates functions, higher-order patterns, partial applications, non-determinism, logical variables, currying, types, lazyness, domain variables, constraints and nite domain propagators. The paper also presents TOY(FD), an extension of the functional logic language TOY that provides FD constraints, and shows, by examples, that TOY(FD) combines the power of constraint logic programming with the higher-order characteristics of functional logic programming.
منابع مشابه
Embedding Propagators in a Concurrent Constraint Language
Solving large and hard discrete combinatorial problems often requires the design of new constraints. Current constraint systems focus on either highlevel modeling or efficient implementation technology. While each approach lacks the advantages of the other one, this paper describes the combination of them in the high-level concurrent constraint language Oz. We describe an interface to Oz provid...
متن کاملProgrammed Search in a Timetabling Problem over Finite Domains
Labeling is crucial in the performance of solving timetabling problems with constraint programming. Traditionally, labeling strategies are based on static and dynamic information about variables and their domains, and selecting variables and values to assign. However, the size of combinatorial problems tractable by these techniques is limited. In this paper, we present a real problem solved wit...
متن کاملConstraint Satisfaction Using Constraint Logic Programming
Van Hentenryck, P., H. Simonis and M. Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence 58 (1992) 113-159. Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment). CLP languages naturally combine constraint propagation ...
متن کاملTwo-Literal Logic Programs and Satisfiability Representation of Stable Models: A Comparison
Logic programming with the stable model semantics has been proposed as a constraint programming paradigm for solving constraint satisfaction and other combinatorial problems. In such a language one writes function-free logic programs with negation. Such a program is instantiated to a ground program from which the stable models are computed. In this paper, we identify a class of logic programs f...
متن کاملEfficient Labelling and Constraint Relaxation for Solving Time Tabling Problems
Constraint Logic Programming over Finite Domains, CLP(FD), has been in constant development for a few years. CLP(FD) allows an efficient resolution of various highly combinatorial problems in scheduling, cutting-stock, warehouse location, planning, molecular biology ... [DIN 90a,b,c], [BAP 92], [BEL 92], [CHA 92], [CLA 93], [BOI 94b]. From a software engineering view point, this approach provid...
متن کامل